Local configurations in discrete combinatorial surfaces

نویسندگان

  • Yukiko Kenmochi
  • Yusuke Nomura
چکیده

Representing discrete objects by polyhedral complexes, we can define all conceivable topological characteristics of points in discrete objects, namely those of vertices of polyhedral complexes. Such a topological characteristic is determined for each point by observing a configuration of object points in the 3 × 3 × 3 local point set of its neighbors. We study a topological characteristic such that the point is in the boundary of a 3D polyhedral complex and the boundary forms a 2D combinatorial surface. By using the topological characteristic, we present an algorithm which examines whether the central point of a local point set is in a combinatorial surface, and show how many local point configurations exist in combinatorial surfaces in a 3D discrete space.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Combinatorial Approach to Discrete Fracture Network Modeling in Heterogeneous Media

Fractured reservoirs contain about 85 and 90 percent of oil and gas resources respectively in Iran. A comprehensive study and investigation of fractures as the main factor affecting fluid flow or perhaps barrier seems necessary for reservoir development studies. High degrees of heterogeneity and sparseness of data have incapacitated conventional deterministic methods in fracture network modelin...

متن کامل

Discrete rotations and symbolic dynamics

The aim of this paper is to study local configurations issued from discrete rotations. The algorithm of discrete rotations that we consider is the discretized rotation. It simply consists in the composition of a Euclidean rotation with a rounding operation, as studied in [B. Nouvel, E. Rémila, On colorations induced by discrete rotations, in: DGCI, in: LNCS, vol. 2886, 2003, pp. 174–183; B. Nou...

متن کامل

Increasing Interconnection Network Connectivity for Reducing Operator Complexity in Asynchronous Vision Systems

Geometric robot mapping p. 11 Discrete geometry applied in hard real-time systems validation p. 23 Hierarchical watersheds within the combinatorial pyramid framework p. 34 Optimal design of 2D/3D hierarchical content-based meshes for multimedia p. 45 Receptive fields for generalized map pyramids : the notion of generalized orbit p. 56 Resolution pyramids on the FCC and BCC grids p. 68 The Mojet...

متن کامل

Brun expansions of stepped surfaces

Dual maps have been introduced as a generalization to higher dimensions of word substitutions and free group morphisms. In this paper, we study the action of these dual maps on particular discrete planes and surfaces – namely stepped planes and stepped surfaces. We show that dual maps can be seen as discretizations of toral automorphisms. We then provide a connection between stepped planes and ...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Image Vision Comput.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2007